- coarse synchronization
- грубая синхронизация
English-Russian dictionary of telecommunications and their abbreviations. A.V. Alexandrov.. 2004.
coarse synchronization
Смотреть что такое "coarse synchronization" в других словарях:
Non-blocking synchronization — In computer science, non blocking synchronization ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. Literature up to the turn of the century used non blocking synonymously … Wikipedia
грубая синхронизация — — [Я.Н.Лугинский, М.С.Фези Жилинская, Ю.С.Кабиров. Англо русский словарь по электротехнике и электроэнергетике, Москва, 1999 г.] Тематики электротехника, основные понятия EN coarse synchronizationcoarse synchronizing … Справочник технического переводчика
Lock (computer science) — In computer science, a lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. Locks are one way of enforcing concurrency control policies. Contents 1 Types 2… … Wikipedia
Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Global Positioning System — GPS redirects here. For other uses, see GPS (disambiguation). Geodesy Fundamentals … Wikipedia
Synchronous optical networking — (SONET) and Synchronous Digital Hierarchy (SDH), are two closely related multiplexing protocols for transferring multiple digital bit streams using lasers or light emitting diodes (LEDs) over the same optical fiber. The method was developed to… … Wikipedia
RTLS communications — Articleissues essay=July 2008 copyedit=May 2008 refimprove=August 2008RTLS communications is a special breed of wireless communicating with the aim to support locating wireless nodes not only topologically, but merely topographically outdoors or… … Wikipedia
Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… … Wikipedia
Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the … Wikipedia
OpenMP — Original author(s) OpenMP Architecture Review Board[1] Developer(s) OpenMP Architecture Review Board … Wikipedia
Granularity — is the extent to which a system is broken down into small parts, either the system itself or its description or observation. It is the extent to which a larger entity is subdivided. For example, a yard broken into inches has finer granularity… … Wikipedia
